Перевод: со всех языков на русский

с русского на все языки

free functor

См. также в других словарях:

  • Functor — For functors as a synonym of function objects in computer programming to pass function pointers along with its state, see function object. For the use of the functor morphism presented here in functional programming see also the fmap function of… …   Wikipedia

  • Free object — In mathematics, the idea of a free object is one of the basic concepts of abstract algebra. It is a part of universal algebra, in the sense that it relates to all types of algebraic structure (with finitary operations). It also has a clean… …   Wikipedia

  • Free Lie algebra — In mathematics, a free Lie algebra, over a given field K, is a Lie algebra generated by a set X, without any imposed relations. Contents 1 Definition 2 Universal enveloping algebra 3 Hall sets …   Wikipedia

  • Free group — In mathematics, a group G is called free if there is a subset S of G such that any element of G can be written in one and only one way as a product of finitely many elements of S and their inverses (disregarding trivial variations such as st 1 =… …   Wikipedia

  • Free lattice — In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice. As free objects, they have the universal property. The word problem for free lattices is also challenging.Formal definitionAny set X may be …   Wikipedia

  • Free Boolean algebra — In abstract algebra, a branch of mathematics, a free Boolean algebra is a Boolean algebra 〈 B , F 〉, such that the set B (called the carrier ) has a subset whose elements are called generators. The generators satisfy the following properties:… …   Wikipedia

  • Free algebra — This article is about free algebras in ring theory. For the more general free algebras in universal algebra, see free object. In mathematics, especially in the area of abstract algebra known as ring theory, a free algebra is the noncommutative… …   Wikipedia

  • Forgetful functor — In mathematics, in the area of category theory, a forgetful functor is a type of functor. The nomenclature is suggestive of such a functor s behaviour: given some object with structure as input, some or all of the object s structure or properties …   Wikipedia

  • Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… …   Wikipedia

  • Representable functor — In mathematics, especially in category theory, a representable functor is a functor of a special form from an arbitrary category into the category of sets. Such functors give representations of an abstract category in terms of known structures (i …   Wikipedia

  • Tor functor — In higher mathematics, the Tor functors of homological algebra are the derived functors of the tensor product functor. They were first defined in generality to express the Künneth theorem and universal coefficient theorem in algebraic… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»